Constraint Logic Programming for Scheduling and Planning
نویسندگان
چکیده
This paper provides an introduction to Finite-domain Constraint Logic Programming (CLP) and its application to problems in scheduling and planning. We cover the fundamentals of CLP and indicate recent developments and trends in the eld. Some current limitations are identiied, and areas of research that may contribute to addressing these limitations are suggested.
منابع مشابه
Visopt ShopFloor: On the Edge of Planning and Scheduling
Visopt ShopFloor is a complete system for solving real-life scheduling problems in complex industries. In particular, the system is intended to problem areas where traditional scheduling methods failed. In the paper we describe the heart of the Visopt system, a generic scheduling engine. This engine goes beyond traditional scheduling by offering some planning capabilities. We achieved this inte...
متن کاملApplying Constraint Satisfaction Technique in University Timetable Scheduling
Planning and scheduling are often NP-complete problems. There have been different approaches to tackle these problems. With the emergence of constraint logic programming, the constraint satisfaction approach has started to attract attention due to its effectness in solving these real-life problems. In this paper, we report our experience of applying constraint logic programming to fully automat...
متن کاملVisopt ShopFloor
Visopt ShopFloor is a complete system for solving real-life scheduling problems in complex industries. In particular, the system is intended to problem areas where traditional scheduling methods failed. In the paper we describe the heart of the Visopt system, a generic scheduling engine. This engine goes beyond traditional scheduling by offering some planning capabilities. We achieved this inte...
متن کاملACLP: Integrating Abduction and Constraint Solving
ACLP is a system which combines abductive reasoning and constraint solving by integrating the frameworks of Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP). It forms a general highlevel knowledge representation environment for abductive problems in Artificial Intelligence and other areas. In ACLP, the task of abduction is supported and enhanced by its non-trivial integr...
متن کاملTutorial of Constraint Programming
Constraint programming, different from imperative and functional programing, is a declarative paradigm in which the programs or the problems are specified using a set of constraints instead of an algorithm. Programmers need not to describe how to solve the constraints. A general constraint solver will do this. A good example under this paradigm is logic computing. This scenario reflects the hig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995